Generalised Rabin(1) synthesis
نویسنده
چکیده
for which each of the assumptions ai and guarantees gi has a Rabin index of one. We show how to build a parity game with at most five colours that captures all solutions to the synthesis problem from such a specification. This parity game has a structure that is amenable to symbolic implementations. We furthermore show that the results obtained are in some sense tight, i.e., that there does not exist a similar synthesis method for assumptions and specifications of higher Rabin index, provided that P 6= NP .
منابع مشابه
Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions
We consider nite-state games as a model of nonterminating reactive computations. A natural type of speciication is given by games with Streett winning condition (corresponding to automata accepting by conjunctions of fairness conditions). We present an algorithm which solves the problem of program synthesis for these speciications. We proceed in two steps: First, we give a reduction of Streett ...
متن کاملNoncommuting Electric Fields and Algebraic Consistency in Noncommutative Gauge Theories
We show that noncommuting electric fields occur naturally in θ-expanded noncommutative gauge theories. Using this noncommutativity, which is field dependent, and a hamiltonian generalisation of the Seiberg-Witten map, the algebraic consistency in the lagrangian and hamiltonain formulations of these theories, is established. A comparison of results in different descriptions shows that this gener...
متن کاملGeneralized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly generate prototype implementations for realizable
متن کاملStrategy Synthesis for Stochastic Rabin Games with Discounted Reward
Stochastic games are often used to model reactive processes. We consider the problem of synthesizing an optimal almost-sure winning strategy in a two-player (namely a system and its environment) turnbased stochastic game with both a qualitative objective as a Rabin winning condition, and a quantitative objective as a discounted reward. Optimality is considered only over the almost-sure winning ...
متن کاملBounded Synthesis for Streett, Rabin, and CTL∗
SMT-based bounded synthesis uses an SMT solver to synthesize systems from LTL properties by going through co-Büchi automata. In this paper, we show how to extend the ranking functions used in Bounded Synthesis, and thus the bounded synthesis approach, to Büchi, Parity, Rabin, and Streett conditions. We show that we can handle both existential and universal properties this way, and therefore, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1003.1684 شماره
صفحات -
تاریخ انتشار 2010